Graphical Eulerian numbers and chromatic generating functions
نویسندگان
چکیده
منابع مشابه
Acyclic orientations and chromatic generating functions
Let P (k) be the chromatic polynomial of a graph with n ≥ 2 vertices and no isolated vertices, and let R(k) = P (k + 1)/k(k + 1). We show that the coefficients of the polynomial (1 − t) ∑ ∞ k=1 R(k)t are nonnegative and we give a combinatorial interpretation to R(k) when k is a nonpositive integer.
متن کاملDerivatives and Eulerian Numbers
The aim of the present note is to give a closed form formula for the nth derivative of a function which satisfies Riccati’s differential equation with constant coefficients. The paper is organized as follows. In section 2 we recall the definition and basic properties of Eulerian numbers. We introduce and prove the mentioned formula in section 3. Some examples where the formula can be applied ar...
متن کاملCongruences on Stirling Numbers and Eulerian Numbers
In this paper, we establish some Fleck-Weisman type congruences for the Stirling numbers and the Eulerian numbers.
متن کاملGraphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
Karger, Motwani and Sudan (JACM 1998) introduced the notion of a vector coloring of a graph. In particular they show that every k-colorable graph is also vector kcolorable, and that for constant k, graphs that are vector kcolorable can be colored by roughly 1 2=k colors. Here is the maximum degree in the graph. Their results play a major role in the best approximation algorithms for coloring an...
متن کاملLaurent polynomials and Eulerian numbers
Article history: Received 24 August 2009 Available online 25 February 2010
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90109-9